منابع مشابه
Constructing graphs with several pseudosimilar vertices or edges
Some of the most interesting problems connected with pseudosimilarity in graphs concern the construction of graphs with large sets of pseudosimilar vertices or edges. This can be understood in two ways: either the graph contains a large set of vertices or edges which are mutually pseudosimilar or else for every vertex (edge) in the graph there is another vertex (edge) to which it is pseudosimil...
متن کاملConstruction of Codes Identifying Sets of Vertices
In this paper the problem of constructing graphs having a (1,≤ `)-identifying code of small cardinality is addressed. It is known that the cardinality of such a code is bounded by Ω ( `2 log ` log n ) . Here we construct graphs on n vertices having a (1,≤ `)-identifying code of cardinality O (`4 log n) for all ` ≥ 2. We derive our construction from a connection between identifying codes and sup...
متن کاملIntriguing Sets of Vertices of Regular Graphs
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with these notions. Indeed, we show that some of the results obtained earlier can be generalized to larger classes of graphs. We also give some connections and relations with other notions and results from algebraic graph th...
متن کاملRigid origami vertices: conditions and forcing sets
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as in the unassigned case. We also illustrate the utility of this result by applying it to the new concept of minimal forcing sets for rigid origami models, wh...
متن کاملOn geodetic sets formed by boundary vertices
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types of boundary vertices: peripheral, contour and eccentric vertices. Before showing that one of the main results in [3] does not hold for one of the cases, we establish a realiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00379-b